Squared Chromatic Number Without Claws or Large Cliques
نویسندگان
چکیده
منابع مشابه
Large Cliques in Graphs with High Chromatic Number
We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Our goal is to determine if in these cases high chromatic number forces the existence of large cliques in the graphs. We consider two different models: in the first one the chromatic number is a fixed fraction of the order, in the other, the difference of the order and the chromatic number is a s...
متن کاملOn universal graphs without cliques or without large bipartite graphs
For every uncountable cardinal A, suitable negations of the Generalized Continuum Hypothesis imply: (a) There is no universal Ka 3. The instance Kuf^>t for A = Ni was settled in [KP] from a strengthening of CH.
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملUniversal Graphs without Large Cliques
The theory of universal graphs originated from the observation of R. Rado [4,5] that a universal countable graph X exists, i.e., X is countable and isomorphically embeds every countable graph. He also showed that under GCH, there is a universal graph in every infinite cardinal. Since then, several results have been proved about the existence of universal elements in different classes of graphs....
متن کاملGraphs with Large Distinguishing Chromatic Number
The distinguishing chromatic number χD(G) of a graph G is the minimum number of colours required to properly colour the vertices of G so that the only automorphism of G that preserves colours is the identity. For a graph G of order n, it is clear that 1 6 χD(G) 6 n, and it has been shown that χD(G) = n if and only if G is a complete multipartite graph. This paper characterizes the graphs G of o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Canadian Mathematical Bulletin
سال: 2019
ISSN: 0008-4395,1496-4287
DOI: 10.4153/cmb-2018-024-5